# I spent longer than I planned on thinking about the game, but my strategy is
# still very simple:
#   help everybody in the first round;
#   thereafter, help the top n/2 people with highest reputations, where n/2 is
#     rounded up or down in alternate rounds.
# The code is squashed because I'm lazy. There's not much mathematical
# justification; I just want to keep a reputation > 1/2 because it feels like
# other algorithms will be nicer to me.
def hunt_choices(round_number, current_food, current_reputation, m,
		player_reputations):
	if round_number == 1:
		return ['h' for rep in player_reputations]
	trank = (len(player_reputations) + round_number % 2) // 2
	return ['sh'[repRank >= trank] for (repRank,_) in sorted(enumerate(sorted(enumerate(player_reputations), key=lambda x: x[1])), key=lambda x: x[1][0])]

def hunt_outcomes(food_earnings): pass

def round_end(award, m, number_hunters): pass
